Incomplete k-ary n-cube and its derivatives

Incomplete k-ary n-cube and its derivatives

Incomplete or pruned k-ary n-cube, nX3; is derived as follows. All links of dimension n 1 are left in place and links of the remaining n 1 dimensions are removed, except for one, which is chosen periodically from the remaining dimensions along the intact dimension n 1: This leads to a node degree of 4 instead of the original 2n and results in regular networks that are Cayley graphs, provided th...

Performance Analysis of k-ary n-cube Interconnection Networks

Enhanced Cluster k-Ary n-Cube, A Fault-Tolerant Multiprocessor

In this paper, we present a strongly fault-tolerant design for the k-ary n-cube multiprocessor and examine its reconfigurability. Our design augments the k-ary n-cube with ðjÞ n spare nodes. Each set of j regular nodes is connected to a spare node and the spare nodes are interconnected as either a ðkjÞ-ary n-cube if j 61⁄4 k2 or a hypercube of dimension n if j 1⁄4 k2 . Our approach utilizes the...

Performance Analysis of k-Ary n-Cube Interconnection Networks

Abstmct-VLSI communication networks are wire-limited. The cost of a network is not a function of the number of switches required, but rather a function of the wiring density required to construct the network. This paper analyzes communication networks of varying dimension under the assumption of constant wire bisection. Expressions for the latency, average case throughput, and hot-spot throughp...

Modeling Free-Space Optical k-ary n-Cube Wormhole Networks

This paper presents an optical interconnect model for k-ary n-cube network topologies based on free-space analysis. This model integrates relevant parameters inherent to optics with traditional network parameters to make it applicable for performance evaluation of parallel processor optical network designs. We apply this model to a free-space diffractive-reflective optical interconnect design a...